Location:
Search - maze problem
Search list
Description: 迷宫问题，能够实现找到最短路径走出迷宫，-Maze problem, find the shortest path to achieve out of the maze,
Platform: |
Size: 1024 |
Author: 陈子杰 |
Hits:
Description: A star 算法的C++语言实现（A* 算法接口，针对迷宫问题设计）-A star algorithm in C++ language (A* algorithm interface design for the maze problem)
Platform: |
Size: 3072 |
Author: 郭世强 |
Hits:
Description: 数据结构里的迷宫问题求解，文档中有VC6.0编程源代码-Data structure in the maze problem solving, documentation, program source code in VC6.0
Platform: |
Size: 11264 |
Author: fdfds |
Hits:
Description: 骑士救公主（问题本质为迷宫问题）
地图由‘.’ ，‘#’，n(0≤n≤9)三种符号构成，‘.’表示平地骑士可以进入，‘#’表示陷阱骑士不能进入，n表示该方格有一个生命力为n的怪物，骑士需要花费n秒时间才能消灭它。
-Knight rescue the princess (nature of the problem for the maze problem) map by the ' .' ,' #' , N (0 ≤ n ≤ 9) constitute the three symbols, ' .' Said the knight to enter the ground, ' #' , said Knight could not enter the trap , n has a vitality that the square is n monster, knight takes n seconds to destroy it.
Platform: |
Size: 1024 |
Author: wmj |
Hits:
Description: 迷宫问题演示程序
以一个n*n的方阵表示迷宫，0和1分别表示迷宫中的通路和障碍。迷宫问题要求求出从入口（1，1）到出口（n,n）的所有通路，或得出没有通路的结论。
具体要求是：程序启动后显示一张迷宫图板，用白色的方格表示通路，黑色的方格表示障碍。用户可以通过点击的方式改变迷宫图板上通路，设置新的迷宫状态图，然后可以由用户按“开始执行”按钮，即可在迷宫图板上显示从入口（1，1）到出口（n,n）的所有通路。
-Maze problem demo
With a n* n phalanx, says maze, respectively 0 and 1 the pathways and obstacles said maze. Maze problem requirements give from entry (1, 1) to export (n, n), or all the pathways that no pathways conclusion.
Specific requirement is: after starting the program with a labyrinth board, showed white checked says pathways, black squares says obstacles. The user can change the way by clicking on a maze set new pathways, board, which can then be a state chart maze by users click "start execution button to display on board in the maze from entry (1, 1) to export (n, n) all of the passages.
Platform: |
Size: 6144 |
Author: eminem@ |
Hits:
Description: 比较普遍的迷宫问题，应用数据结构中的链表解决-Maze problem more common application of the linked list data structure to solve
Platform: |
Size: 1024 |
Author: |
Hits:
Description: 这是心理学中的一个经典问题。心理学家把一只老鼠从一个无顶盖的大盒子的入口处放入，让老鼠自行找到出口出来。迷宫中设置很多障碍阻止老鼠前行，迷宫唯一的出口处放有一块奶酪，吸引老鼠找到出口。
简而言之，迷宫问题是解决从布置了许多障碍的通道中寻找出路的问题-This is a classic problem in psychology. Psychologists without a mouse from a roof at the entrance into the big box, so that rats find their own exit. Set many obstacles in the maze to prevent mouse forward, the only exit of the maze placed on a piece of cheese, find the exit to attract rats. In short, the maze is to solve a lot of obstacles from the layout of the channel in question to find a way out
Platform: |
Size: 2048 |
Author: 郑直 |
Hits:
Description: 这是一个老鼠走迷宫的问题，这是我第一次上传，有问题请见谅。-This is a rat maze problem, this is my first upload, have questions, please forgive me.
Platform: |
Size: 1069056 |
Author: 陈鹏 |
Hits:
Description: 实现了经典的迷宫求解问题和双向循环链表问题，应用性很强-To achieve a classic two-way circular maze solving problems and problem list, the application of highly
Platform: |
Size: 4096 |
Author: 黎明 |
Hits:
Description: 简单迷宫的搜索问题，其中#为路，*为墙，0为入口，1为出口，输入地图为矩阵-Simple maze search problem, where# is the way* for the wall, 0 is the entrance, one for export, enter the matrix map
Platform: |
Size: 1024 |
Author: 123 |
Hits:
Description: 本文在脉冲耦合神经网络(PCNN2Pulse Coupled Neural Network) 的基础上,提出了时延脉冲耦合神经网络
(DPCNN2Delay PCNN) ,并将其成功地用于求解最短路径,同时给出了基于DPCNN 的最短路径求解算法. Caulfield 与
Kinser 提出了用PCNN 求解迷宫问题的方法,虽然他们的方法也可用于求解最短路径,但所需神经元的数量巨大,而本
文的方法所需的神经元的数量远小于他们的方法. 同时,本文的方法充分利用了DPCNN 脉冲快速并行传播的特点,可
迅速地求出最短路径,其所需的计算量仅正比于最短路径的长度,与路径图的复杂程度及路径图中的通路总数无关.
计算机仿真结果表明,采用本文的方法,用少量的神经元就可迅速地求出最短路径.- This paper presents DPCNN(Delay Pulse Coupled Neural Network) based on PCNN and uses DPCNN to find the
shortest path successfully.Meanwhile ,the algorithmof finding the shortest path based on DPCNN is described. Caulfield and Kinser in2
troduced the PCNN method to solve the maze problem and although their method also can be used to find the shortest path ,a large
quantity of neurons are needed. However ,the approach proposed in this paper needed very fewer neurons than proposed by Caulfield
and Kinser. In the meantime ,due to the pulse parallel transmission characteristic of DPCNN ,the approach proposed can find the short2
est path quickly. The computational complexity of our approach is only related to the length of the shortest path , and independent to
the path graph complexity and the number of existing paths in the graph. The results of computer simulations show that by using the
approach proposed in this paper ,we can use a small quantity of neurons to find the shortest p
Platform: |
Size: 102400 |
Author: wangxx |
Hits:
Description: 解决数据结构中的迷宫问题，这是大学三年级数据结构中的一道程序解法-
翻译文字或网页
解决数据结构中的迷宫问题，这是大学三年级数据结构中的一道程序解法
请键入文字或网站地址，或者上传文档。
取消
Jiějué shùjù jiégòu zhōng de mígōng wèntí, zhè shì dàxué sān niánjí shùjù jiégòu zhōng de yīdào chéngxù jiěfǎ将中文译成英语
Data structure to solve the maze problem, which is third-year university program data structures in a solution.
取消
Jiějué shùjù jiégòu zhōng de mígōng wèntí, zhè shì dàxué sān niánjí shùjù jiégòu zhōng de yīdào chéngxù jiěfǎ将中文译成英语
Data structure to solve the maze problem, which is third-year university program data structures in a solution
Platform: |
Size: 12288 |
Author: 刘斌斌 |
Hits:
Description: 迷宫求解问题是数据结构中的经典问题，利用栈的原理。-maze problem
Platform: |
Size: 9216 |
Author: liwenxue |
Hits:
Description: C语言版的数据结构解决迷宫问题的源代码，功能齐全-C language version of the data structure to solve the maze problem s source code, full-featured
Platform: |
Size: 7168 |
Author: xienaxin |
Hits:
Description: 以一个M×N的长方阵表示迷宫，0和1分别表示迷宫中的通路和障碍。设计一个程序，对任意设定的迷宫，求出一条从入口到出口的通路，或得出没有通路的结论。-Maze problem
Platform: |
Size: 1024 |
Author: 周阳 |
Hits:
Description: 最基础的走迷宫问题。
只用栈的思想，不用栈的物理结构。-The most basic of the maze problem. Only the idea of the stack without the physical structure of the stack
Platform: |
Size: 1024 |
Author: 张贺 |
Hits:
Description: 数据结构堆栈的经典应用：
/*一:迷宫问题用堆栈的方法:
求迷宫中一条从入口到出口的路径的算法可简单描述如下:
设定当前位置的初值为入口位置:
do{
若当前位置可通,
则{ 将当前位置插入堆栈顶
若该位置是出口位置,则结束
否则切换当前位置的东邻块为新的当前位置
}
否则,
若堆栈不空且栈顶位置尚有其他方向未经探索
则设定新的当前位置为沿顺时针方向转到的栈顶位置的下一相邻块
若栈不空但栈顶位置的四周均不可通,
则{删去栈顶位置
若栈不空,则重新测试新的栈顶位置,
直至找到一个可通的相邻或出栈至栈空
}
}(栈不空)*/-Classic application of the data structure stack:
/* A: maze problem with the stack:
Seeking an entrance to the exit in the maze path algorithm can be described as follows:
Set the initial value of the current location of the entrance location:
do {
If the current location through
Then {the current position into the top of the stack
If the location is the export position, the end
Otherwise, switch the current location of the east block for the new current position
}
Otherwise, the
If the stack is not empty and the stack position that there are other directions unexplored
Set a new current position clockwise to the top of the stack location of the next adjacent block
If the stack is not empty but the top of the stack around the location of the incommensurability
{By deleting the top of the stack location
If the stack is not empty, then re-test the new stack location
Until you find a pass adjacent to the stack
Platform: |
Size: 1024 |
Author: 向曦 |
Hits:
Description: 迷宫问题的求解，在源代码中创建迷宫，按照步骤输出迷宫。-Maze problem solving, in the source code to create a maze, follow the steps to output the maze.
Platform: |
Size: 2048 |
Author: 李斯境 |
Hits:
Description: 迷宫问题广度优先搜索，本程序针对迷宫问题，采用广度优先策略惊醒搜索，如能到达，输出路径长度，否则输出-1表示不可到达-Breadth-first search of the maze problem
Platform: |
Size: 1024 |
Author: Bruce Mann |
Hits:
Description: 机器人走迷宫的C语言代码，可以解决走迷宫问题-Robot Maze C language code, you can solve the maze problem
Platform: |
Size: 3072 |
Author: 高静迁 |
Hits:
«
1
2
...
5
6
7
8
9
1011
12
13
14
15
...
18
»